-
1 maximal acyclic digraph
Математика: максимальный ациклический орграфУниверсальный англо-русский словарь > maximal acyclic digraph
-
2 maximal acyclic digraph
т. граф.English-Russian scientific dictionary > maximal acyclic digraph
-
3 acyclic
1) ацикличный
2) нециклический
3) научн. непериодический
4) ациклический ∙ integrally acyclic complex ≈ целочисленно ацикличный комплекс maximal acyclic digraph ≈ максимальный ациклический орграф method of acyclic models ≈ метод ацикличных моделей rationally acyclic complex ≈ рационально ацикличный комплекс - acyclic algebra - acyclic carrier - acyclic complex - acyclic continuum - acyclic cover - acyclic fibration - acyclic function - acyclic graph - acyclic image - acyclic manifold - acyclic model - acyclic morphism - acyclic net - acyclic object - acyclic orientation - acyclic parallelotope - acyclic polyhedron - acyclic property - acyclic relation - acyclic resolvent - acyclic set - acyclic sheaf - acyclic simplex - acyclic space - acyclic star - acyclic subcomplex - acyclic support - acyclic tree(техническое) нецикличный;
непериодического действия( химическое) ациклический (математика) непериодический (ботаника) спиральныйacyclic апериодический ~ непериодический -
4 digraph
ориентированный граф, орграф
См. также в других словарях:
Digraph (mathematics) — A directed graph or digraph G is an ordered pair G := (V, A) with * V is a set, whose elements are called vertices or nodes, * A is a set of ordered pairs of vertices, called directed edges, arcs, or arrows.It differs from an ordinary, undirected … Wikipedia
Glossary of graph theory — Graph theory is a growing area in mathematical research, and has a large specialized vocabulary. Some authors use the same word with different meanings. Some authors use different words to mean the same thing. This page attempts to keep up with… … Wikipedia
Directed graph — A directed graph. A directed graph or digraph is a pair G = (V,A) (sometimes G = (V,E)) of:[1] a set V, whose elements are called vertices or … Wikipedia
Glossary of order theory — This is a glossary of some terms used in various branches of mathematics that are related to the fields of order, lattice, and domain theory. Note that there is a structured list of order topics available as well. Other helpful resources might be … Wikipedia
List of terms relating to algorithms and data structures — The [http://www.nist.gov/dads/ NIST Dictionary of Algorithms and Data Structures] is a reference work maintained by the U.S. National Institute of Standards and Technology. It defines a large number of terms relating to algorithms and data… … Wikipedia
Список терминов, относящихся к алгоритмам и структурам данных — Это служебный список статей, созданный для координации работ по развитию темы. Данное предупреждение не устанавливается на информационные списки и глоссарии … Википедия
Список терминов — Список терминов, относящихся к алгоритмам и структурам данных Это сл … Википедия
Tournament (graph theory) — Tournament A tournament on 4 vertices Vertices n Edges … Wikipedia
List of NP-complete problems — Here are some of the more commonly known problems that are NP complete when expressed as decision problems. This list is in no way comprehensive (there are more than 3000 known NP complete problems). Most of the problems in this list are taken… … Wikipedia
Liste De Problèmes NP-Complets — Ceci est une liste des problèmes NP complets les plus connus en théorie de la complexité des algorithmes, exprimés sous la forme d un problèmes de la décision. Puisqu on connaît plus de 3000 problèmes NP complets, cette liste n est pas exhaustive … Wikipédia en Français
Liste de problemes NP-complets — Liste de problèmes NP complets Ceci est une liste des problèmes NP complets les plus connus en théorie de la complexité des algorithmes, exprimés sous la forme d un problèmes de la décision. Puisqu on connaît plus de 3000 problèmes NP complets,… … Wikipédia en Français
